Traffic Grooming in WDM Ring Networks with the Min-Max Objective

نویسندگان

  • Bensong Chen
  • George N. Rouskas
  • Rudra Dutta
چکیده

We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consider a Min-Max objective, in which it is desirable to minimize the cost at the node where this cost is maximum. Such an objective is of practical value when dimensioning a network for unknown future traffic demands and/or for dynamic traffic scenarios. We prove that traffic grooming with the MinMax objective is NP-Complete even when wavelength assignment is not an issue. We also present a new polynomial-time algorithm for Min-Max traffic grooming. Experiments with a wide range of problem instances demonstrate that our algorithm produces solutions which are always close to the optimal and/or the lower bound, and which scale well to large network sizes, large number of wavelengths, and high loads.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Traffic grooming in WDM ring networks to minimize the maximum electronic port cost

Abstract— We consider the problem of traffic grooming in WDM ring networks. Traffic grooming is a variant of the wellknown logical topology design problem, and is concerned with the development of techniques for combining low speed traffic components onto high speed channels in order to minimize network cost. Previous studies have focused on aggregate representations of the network cost. In thi...

متن کامل

ABSTRACT SRINIVASARAO, KOUNDINYA B. Traffic Grooming in Translucent Optical Ring Net-

SRINIVASARAO, KOUNDINYA B. Traffic Grooming in Translucent Optical Ring Networks. (Under the direction of Dr. Rudra Dutta). The exponential growth of the Internet has resulted in an ever increasing demand for bandwidth. Carrier networks which form the backbone of the Internet, have been designed to carry only voice signals with predictable traffic patterns and anticipating slow growth of the ne...

متن کامل

A Dynamic Traffic Grooming Algorithm in Multi-granularity Heterogeneous Optical WDM Mesh Networks

We consider the problem of traffic grooming in wavelength division multiplexing networks. Our objective is to minimize the required number of electronic add-drop multiplexers. We investigate the problem of efficiently provisioning connections of different bandwidth granularities in a heterogeneous WDM mesh network through dynamic traffic grooming schemes under traffic engineering principles. We...

متن کامل

Traffic grooming in an optical WDM mesh network

In wavelength-division multiplexing (WDM) optical networks, the bandwidth request of a traffic stream can be much lower than the capacity of a lightpath. Efficiently grooming low-speed connections onto high-capacity lightpaths will improve the network throughput and reduce the network cost. In WDM/SONET ring networks, it has been shown in the optical network literature that by carefully groomin...

متن کامل

Effective traffic grooming in WDM rings

Much work has focused on traffic grooming in WDM ring networks. Previous work has considered many aspects of traffic grooming, including minimizing number of ADMs, minimizing number of wavelengths, single hub and multiple hub architectures, switching capabilities etc. In this work, we derive general and tighter bounds on the number of wavelengths in WDM ring networks that may be capable of swit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004